Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
نویسندگان
چکیده
منابع مشابه
A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملOn the Solution of the Linear Complementarity Problem by the Generalized Accelerated Overrelaxation Iterative Method
In the present work, we determine intervals of convergence for the various parameters involved for what is known as the Generalized Accelerated Overrelaxation iterative method for the solution of the Linear Complementarity Problem. The convergence intervals found constitute sufficient conditions for the Generalized Accelerated Overrelaxation method to converge and are better than what have been...
متن کاملa full nesterov-todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
a full nesterov-todd (nt) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using euclidean jordan algebra. two types of full nt-steps are used, feasibility steps and centering steps. the algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملOn the Successive Overrelaxation Method
Problem statement: A new variant of the Successive Overrelaxation (SOR) method for solving linear algebraic systems, the KSOR method was introduced. The treatment depends on the assumption that the current component can be used simultaneously in the evaluation in addition to the use the most recent calculated components as in the SOR method. Approach: Using the hidden explicit characterization ...
متن کاملThe symmetric eigenvalue complementarity problem
In this paper the Eigenvalue Complementarity Problem (EiCP) with real symmetric matrices is addressed. It is shown that the symmetric (EiCP) is equivalent to finding an equilibrium solution of a differentiable optimization problem in a compact set. A necessary and sufficient condition for solvability is obtained which, when verified, gives a convenient starting point for any gradient-ascent loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1988
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01589410